Learning Techniques for Pseudo-Boolean Solving
نویسندگان
چکیده
The extension of conflict-based learning from Propositional Satisfiability (SAT) solvers to Pseudo-Boolean (PB) solvers comprises several different learning schemes. However, it is not commonly agreed among the research community which learning scheme should be used in PB solvers. Hence, this paper presents a contribution by providing an exhaustive comparative study between several different learning schemes in a common platform. Results for a large set of benchmarks are presented for the different learning schemes, which were implemented on bsolo, a state of the art PB solver.
منابع مشابه
Pseudo - Boolean and Finite Domain Constraint Programming : A Case
Pseudo-Boolean constraints are a special form of nite domain constraints where all variables are deened over the domain f0; 1g. To solve pseudo-Boolean constraints, specialized constraint solving algorithms have been developed. In this paper, we compare nite domain and pseudo-Boolean constraint techniques on a classical application of nite domain constraint programming, the warehouse location p...
متن کاملCombining satisfiability techniques from AI and OR
The recent effort to integrate techniques from the fields of artificial intelligence and operations research has been motivated in part by the fact that scientists in each group are often unacquainted with recent (and not so recent) progress in the other field. Our goal in this paper is to introduce the artificial intelligence community to pseudo-Boolean representation and cutting plane proofs,...
متن کاملThe long way from CDClL
Current SAT solvers are powerful enough to be used as engines in real applications. Those applications made the success of a special kind of SAT solvers, namely Conflict Driven Clause Learning SAT solvers (CDClL for short), developed initially by Joao Marques Silva with GRASP [8], and popularized by the SAT solver Chaff [9]. Despite SAT being a NP-complete problem in theory, it might look tract...
متن کاملPueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflictinduced learning. Novel features of our approa...
متن کاملAssessing the impact of Learning Techniques in Quantified Boolean Logic Satisfiability
Learning, i.e., the ability to record and exploit some information which is unveiled during the search, proved to be a very effective AI technique for problem solving and, in particular, for constraint satisfaction. In (Giunchiglia et al. 2002) we have introduced learning as a general purpose technique to improve the performances of decision procedures for Quantified Boolean Formulas (QBFs). We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008